منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملa new parallel matrix multiplication method adapted on fibonacci hypercube structure
the objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a fibonacci hypercube structure. most of the popular algorithms for parallel matrix multiplication can not run on fibonacci hypercube structure, therefore giving a method that can be run on all structures especially fibonacci hypercube structure is necessary for parallel matr...
متن کاملFibonacci Numbers
One can prove the following three propositions: (1) For all natural numbers m, n holds gcd(m,n) = gcd(m, n + m). (2) For all natural numbers k, m, n such that gcd(k, m) = 1 holds gcd(k,m · n) = gcd(k, n). (3) For every real number s such that s > 0 there exists a natural number n such that n > 0 and 0 < 1 n and 1 n ¬ s. In this article we present several logical schemes. The scheme Fib Ind conc...
متن کاملFibonacci Fields
In this paper, we consider fields determined by the /1 roots of the zeros a and fi of the polynomial x x 1 ; a is the positive zero. The tools for studying these fields will include the Fibonacci and Lucas polynomials. Generalized versions of Fibonacci and Lucas polynomials have been studied in [1], [2], [3], [4], [5], [6], [7], and [12], among others. For the most part, these generalizations c...
متن کاملFibonacci Integers
A Fibonacci integer is an integer in the multiplicative group generated by the Fibonacci numbers. For example, 77 = 21 · 55/(3 · 5) is a Fibonacci integer. Using some results about the structure of this multiplicative group, we determine a near-asymptotic formula for the counting function of the Fibonacci integers, showing that up to x the number of them is between exp(c(log x) − (log x)) and e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1988
ISSN: 0893-9659
DOI: 10.1016/0893-9659(88)90074-2